package leecode;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

class CQueue {
    Stack<Integer>stack1;
    Stack<Integer>stack2;
    public CQueue() {
        stack1=new Stack<>();
        stack2=new Stack<>();
    }

    public void appendTail(int value) {

        stack1.add(value);
    }

    public int deleteHead() {
        if(stack1.empty()&&stack2.empty()){
            return -1;
        }
        while (!stack1.empty()){
            stack2.add(stack1.pop());
        }
        return  stack2.pop();
    }
}
public class leetcode {
    public static void main(String[] args) {

        System.out.println(Math.round(11.5));
    }
}
